Lower Bound on the Size of Keys in Authentication Codes with Arbitration*
نویسندگان
چکیده
For the authentication codes with arbitration, Johansson showed lower bounds on the size of keys, but those bounds are no tighter if the size of source states is large. In the present paper , we first present some new lower bounds on the sizes of keys. Next, we discuss the case for large sizes of source states, and then we show that those bounds are tighter. Key-Words: Authentication, codes, arbitration, bounds, Keys, sizes.
منابع مشابه
Combinatorial Bounds on Authentication Codes with Arbitration
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities and the sizes of keys of A 2-codes. Especially, our bounds for A 2-codes without secrecy are all tight for small size of source states.
متن کاملCombinatorial Classiication of Optimal Authentication Codes with Arbitration Satoshi Obana and Kaoru Kurosawa
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. We rst show that an optimal A 2-code implies an orthogonal array and an aane-resolvable design. Next we deene a new design, an aane-resolvable + BIBD, and prove that optimal A 2-codes are equivalent to this new design. From ...
متن کاملBounds of Authentication Codeswith
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities and the sizes of keys of A 2-codes. Especially, our bounds for A 2-codes without secrecy are all tight for small size of source states. Our m...
متن کاملNew combinatorial bounds for authentication codesand key
This paper provides new combinatorial bounds and characterizations of authentication codes (A-codes) and key predistribution schemes (KPS). We rst prove a new lower bound on the number of keys in an A-code without secrecy, which can be thought of as a generalization of the classical Rao bound for orthogonal arrays. We also prove a new lower bound on the number of keys in a general A-code, which...
متن کاملNew Bound on Authentication Code with Arbitration
For the authentication model with arbitration (A 2-code), Jo-hansson showed a lower bound on the size of encoding rules. However, this bound is no longer tight if the size of source states is large. This paper presents a more tight lower bound on the size of encoding rules for large source states. An A 2-code is shown which approximately meets the proposed bound, also. Further, we show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006